Automatic Peccei–Quinn symmetry

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic CP Invariance and Flavor Symmetry

The approximate conservation of CP can be naturally understood if it arises as an automatic symmetry of the renormalizable Lagrangian. We present a specific realistic example with this feature. In this example, the global Peccei-Quinn symmetry and gauge symmetries of the model make the renormalizable Lagrangian CP invariant but allow non zero hierarchical masses and mixing among the three gener...

متن کامل

Automatic Symmetry Detection in Well-Formed Nets

Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Fo...

متن کامل

Automatic rotational symmetry determination for shape analysis

The determination of the rotational symmetry of a shape is useful for object recognition and shape analysis in computer vision applications. In this paper, a simple, but effective, algorithm to analyse the rotational symmetry of a given closed-curve shape S is proposed. A circle C with the centroid of S as the circle center and the average radius of S as the circle radius is superimposed on S, ...

متن کامل

Automatic Generation of Symmetry-Breaking Constraints

Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of solution symmetries, and two different types of symmetry-breaking constraints to eliminate these symmetries at the modelling level. We discuss some preliminary computational results.

متن کامل

Automatic Completion of Distributed Protocols with Symmetry

A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions. Correctness is specified using safety and liveness requirements. Designing correct distributed protocols is a challenging task. Aimed at simplifying this task, we allow the designer to leave some of the guards and updates ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The European Physical Journal C

سال: 2019

ISSN: 1434-6044,1434-6052

DOI: 10.1140/epjc/s10052-019-7046-3